S Np-c T *
نویسنده
چکیده
Subproblems have become an important object of NP-completeness theory since its beginning. In this paper, we show some undesirable consequences for subproblems deduced by the standard foundation of the theory, which are different from the practical viewpoint of computation. By the consequences, we clarify further the range in which the standard foundation is applicable to decision problems.
منابع مشابه
Interleukin-8-251 A/T and CXCR2 +1208 C/T Genes Polymorphisms in Chronic Rhinosinusitis
Introduction: IL-8 is one of the pro-inflammatory cytokines which can play an essential role in the pathogenesis of chronic rhinosinusitis (CRS) as well as nasal polyposis (NP). The ability of individuals in producing IL-8 is partially determined by IL-8-251 A/T polymorphism. Hence, the aim of the present study was to investigate the association between IL-8-251 A/T and CXCR2 +1208 C/T genes ...
متن کاملThe effects of gestational and lactational exposure to Nonylphenol on c-jun, and c-fos expression and learning and memory in hippocampus of male F1 rat
Objective(s): To investigate the effects of Nonylphenol (NP) in pups from dams exposed during gestational and lactational periods on immediate early genes (c-jun, c-fos) in hippocampus and the learning and memory of F1 rats. Materials and Methods: Twenty eight pregnant dams, stratified by pregnancy date, were randomly assigned into 4 groups, which were gavaged with NP at the doses of 50 mg/kg/d...
متن کاملComplexity measures for public-key cryptosystems
A b s t r a c t The f i r s t p a r t of t h i s paper g i v e s r e s u l t s about promise problems. A "promise problem" i s a formulation of a p a r t i a l d e c i s i o n problem t h a t i s u s e f u l f o r d e s c r i b i n g cracking problems f o r public-key cryptosystems (PKCS). We prove t h a t every NP-hard promise problem i s uniformly NP-hard, and w e show t h a t a number of r e...
متن کاملMost balanced minimum cuts and partially ordered knapsack
We consider the problem of finding most balanced cuts among minimum st-edge cuts and minimum st-vertex cuts, for given vertices s and t, according to different balance criteria. For edge cuts [S, S] we seek to maximize min{|S|, |S|}. For vertex cuts C of G we consider the objectives of (i) maximizing min{|S|, |T |}, where {S, T} is a partition of V (G)\C with s ∈ S, t ∈ T and [S, T ] = ∅, (ii) ...
متن کاملSearch for Nucleon and Dinucleon Decays with an Invisible Particle and a Charged Lepton in the Final State at the Super-Kamiokande Experiment.
Search results for nucleon decays p→e^{+}X, p→μ^{+}X, n→νγ (where X is an invisible, massless particle) as well as dinucleon decays np→e^{+}ν, np→μ^{+}ν, and np→τ^{+}ν in the Super-Kamiokande experiment are presented. Using single-ring data from an exposure of 273.4 kton·yr, a search for these decays yields a result consistent with no signal. Accordingly, lower limits on the partial lifetimes...
متن کاملA Simple Transformation for O ine-Parsable Grammars and its Termination Properties
We present, in easily reproducible terms, a simple transformation for o ineparsable grammars which results in a provably terminating parsing program directly top-down interpretable in Prolog. The transformation consists in two steps: (1) removal of empty-productions, followed by: (2) left-recursion elimination. It is related both to left-corner parsing (where the grammar is compiled, rather tha...
متن کامل